Finite index conditions in rings

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prüfer Conditions in Commutative Rings

This article explores several extensions of the Prüfer domain notion to rings with zero divisors. These extensions include semihereditary rings, rings with weak global dimension less than or equal to 1, arithmetical rings, Gaussian rings, locally Prüfer rings, strongly Prüfer rings, and Prüfer rings. The renewed interest in these properties, due to their connection to Kaplansky’s Conjecture, ha...

متن کامل

Locally finite profinite rings

We investigate the structure of locally finite profinite rings. We classify (Jacobson-) semisimple locally finite profinite rings as products of complete matrix rings of bounded cardinality over finite fields, and we prove that the Jacobson radical of any locally finite profinite ring is nil of finite nilexponent. Our results apply to the context of small compact G-rings, where we also obtain a...

متن کامل

Finite Commutative Rings

‡ Every function on a finite residue class ring D/I of a Dedekind domain D is induced by an integer-valued polynomial on D that preserves congruences mod I if and only if I is a power of a prime ideal. If R is a finite commutative local ring with maximal ideal P of nilpotency N satisfying for all a, b∈R, if ab∈ P then a∈ P k , b∈ P j with k+ j ≥min(n,N), we determine the number of functions (as...

متن کامل

Group rings satisfying generalized Engel conditions

Let R be a commutative ring with unity of characteristic r≥0 and G be a locally finite group. For each x and y in the group ring RG define [x,y]=xy-yx and inductively via [x ,_( n+1)  y]=[[x ,_( n)  y]  , y]. In this paper we show that necessary and sufficient conditions for RG to satisfies [x^m(x,y)   ,_( n(x,y))  y]=0 is: 1) if r is a power of a prime p, then G is a locally nilpotent group an...

متن کامل

Cyclic codes over finite rings

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 2015

ISSN: 0035-7596

DOI: 10.1216/rmj-2015-45-4-1177